Mean Square Convergence of Consensus Algorithms in Random WSNs
نویسندگان
چکیده
منابع مشابه
When Gossip Meets Consensus: Convergence in Correlated Random WSNs
We study the convergence of consensus algorithms in wireless sensor networks with random topologies where the instantaneous links exist with a given probability and are allowed to be spatially correlated. Aiming at minimizing the convergence time of the algorithm, we adopt an optimization criterion based on the spectral radius of a positive semidefinite matrix for which we derive closed-form ex...
متن کاملConvergence Analysis of Proportionate-type Least Mean Square Algorithms
In this paper, we present the convergence analysis of proportionate-type least mean square (Pt-LMS) algorithm that identifies the sparse system effectively and more suitable for real time VLSI applications. Both first and second order convergence analysis of Pt-LMS algorithm is studied. Optimum convergence behavior of Pt-LMS algorithm is studied from the second order convergence analysis provid...
متن کاملMean square convergence analysis for kernel least mean square algorithm
In this paper, we study the mean square convergence of the kernel least mean square (KLMS). The fundamental energy conservation relation has been established in feature space. Starting from the energy conservation relation, we carry out the mean square convergence analysis and obtain several important theoretical results, including an upper bound on step size that guarantees the mean square con...
متن کاملA framework of iterative learning control under random data dropouts: Mean square and almost sure convergence
This paper addresses the iterative learning control problem under random data dropout environments. The recent progress on iterative learning control in the presence of data dropouts is first reviewed from 3 aspects, namely, data dropout model, data dropout position, and convergence meaning. A general framework is then proposed for the convergence analysis of all 3 kinds of data dropout models,...
متن کاملConvergence of max-min consensus algorithms
In this paper, we propose a distributed max–min consensus algorithm for a discrete-time n-node system. Each node iteratively updates its state to a weighted average of its own state together with the minimum and maximum states of its neighbors. In order for carrying out this update, each node needs to know the positive direction of the state axis, as some additional information besides the rela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2010
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2010.2043140